Android CompCache Based on Graphics Processing Unit

Android systems have been successfully developed to meet the demands of users. The following four methods are used in Android systems for memory management: backing swap, CompCache, traditional Linux swap, and low memory killer. These memory management methods are fully functioning. However, Android phones cannot swap memory into solid-state drives, thus slowing the processor and reducing storage lifetime. In addition, the compression and decompression processes consume additional energy and latency. Therefore, the CompCache requires an extension. An extended Android CompCache using a graphics processing unit to compress and decompress memory pages on demand and reduce the latency is introduced in this paper. This paper characterizes each data compression and decompression utility by measuring compression ratio, compression and decompression throughput, and energy efficiency to validate the process. Experimental results prove that data compression and decompression utilities can be beneficial to reduce the latency and perform faster compression and decompression compared with existing approache

A hierarchical classifier for multiclass prostate histopathology image gleason grading

Automated classification of prostate histopathology images includes the identification of multiple classes, such as benign and cancerous (grades 3 & 4).To address the multiclass classification problem in prostate histopathology images, breakdown approaches are utilized, such as one-versus-one (OVO) and one- versus-all (Ovall). In these approaches, the multiclass problem is decomposed into numerous binary subtasks, which are separately addressed.However, OVALL introduces an artificial class imbalance, which degrades the classification performance, while in the case of OVO, the correlation between different classes not regarded as a multiclass problem is broken into multiple independent binary problems. This paper proposes a new multiclass approach called multi-level (hierarchical) learning architecture (MLA). It addresses the binary classification tasks within the framework of a hierarchical strategy. It does so by accounting for the interaction between several classes and the domain knowledge. The proposed approach relies on the ‘divide-and-conquer’ principle by allocating each binary task into two separate subtasks; strong and weak, based on the power of the samples in each binary task. Conversely, the strong samples include more information about the considered task, which motivates the production of the final prediction. Experimental results on prostate histopathological images illustrated that the MLA significantly outperforms the Ovall and OVO approaches when applied to the ensemble framework.The results also confirmed the high efficiency of the ensemble framework with the MLA scheme in dealing with the multiclass classification problem

A HIERARCHICAL CLASSIFIER FOR MULTICLASS PROSTATE HISTOPATHOLOGY IMAGE GLEASON GRADING

Automated classification of prostate histopathology images includes the identification of multiple classes, such as benign and cancerous (grades 3 & 4). To address the multiclass classification problem in prostate histopathology images, breakdown approaches are utilized, such as one-versus-one (OVO) and one- versus-all (Ovall). In these approaches, the multiclass problem is decomposed into numerous binary subtasks, which are separately addressed. However, OVALL introduces an artificial class imbalance, which degrades the classification performance, while in the case of OVO, the correlation between different classes not regarded as a multiclass problem is broken into multiple independent binary problems. This paper proposes a new multiclass approach called multi-level (hierarchical) learning architecture (MLA). It addresses the binary classification tasks within the framework of a hierarchical strategy. It does so by accounting for the interaction between several classes and the domain knowledge. The proposed approach relies on the ‘divide-and-conquer’ principle by allocating each binary task into two separate subtasks; strong and weak, based on the power of the samples in each binary task. Conversely, the strong samples include more information about the considered task, which motivates the production of the final prediction. Experimental results on prostate histopathological images illustrated that the MLA significantly outperforms the Ovall and OVO approaches when applied to the ensemble framework. The results also confirmed the high efficiency of the ensemble framework with the MLA scheme in dealing with the multiclass classification problem

Healthcare knowledge graph construction: A systematic review of the state-of-the-art, open issues, and opportunities

Abstract The incorporation of data analytics in the healthcare industry has made significant progress, driven by the demand for efficient and effective big data analytics solutions. Knowledge graphs (KGs) have proven utility in this arena and are rooted in a number of healthcare applications to furnish better data representation and knowledge inference. However, in conjunction with a lack of a representative KG construction taxonomy, several existing approaches in this designated domain are inadequate and inferior. This paper is the first to provide a comprehensive taxonomy and a bird’s eye view of healthcare KG construction. Additionally, a thorough examination of the current state-of-the-art techniques drawn from academic works relevant to various healthcare contexts is carried out. These techniques are critically evaluated in terms of methods used for knowledge extraction, types of the knowledge base and sources, and the incorporated evaluation protocols. Finally, several research findings and existing issues in the literature are reported and discussed, opening horizons for future research in this vibrant area

Fuzzy Clustering Algorithm Based on Improved Global Best-Guided Artificial Bee Colony with New Search Probability Model for Image Segmentation

Clustering using fuzzy C-means (FCM) is a soft segmentation method that has been extensively investigated and successfully implemented in image segmentation. FCM is useful in various aspects, such as the segmentation of grayscale images. However, FCM has some limitations in terms of its selection of the initial cluster center. It can be easily trapped into local optima and is sensitive to noise, which is considered the most challenging issue in the FCM clustering algorithm. This paper proposes an approach to solve FCM problems in two phases. Firstly, to improve the balance between the exploration and exploitation of improved global best-guided artificial bee colony algorithm (IABC). This is achieved using a new search probability model called PIABC that improves the exploration process by choosing the best source of food which directly affects the exploitation process in IABC. Secondly, the fuzzy clustering algorithm based on PIABC, abbreviated as PIABC-FCM, uses the balancing of PIABC to avoid getting stuck into local optima while searching for the best solution having a set of cluster center locations of FCM. The proposed method was evaluated using grayscale images. The performance of the proposed approach shows promising outcomes when compared with other related works